a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1
A(c(x1)) → B(c(a(x1)))
A(c(x1)) → B(c(a(b(c(a(x1))))))
A(c(x1)) → A(x1)
A(c(x1)) → A(b(c(a(x1))))
a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
A(c(x1)) → B(c(a(x1)))
A(c(x1)) → B(c(a(b(c(a(x1))))))
A(c(x1)) → A(x1)
A(c(x1)) → A(b(c(a(x1))))
a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
A(c(x1)) → A(x1)
A(c(x1)) → A(b(c(a(x1))))
a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(c(x1)) → A(x1)
A(c(x1)) → A(b(c(a(x1))))
The value of delta used in the strict ordering is 81/64.
POL(c(x1)) = 3/4 + (4)x_1
POL(a(x1)) = (4)x_1
POL(A(x1)) = (9/4)x_1
POL(b(x1)) = (1/4)x_1
a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1